A New Table of Constant Weight Codes of Length Greater than 28
نویسندگان
چکیده
Existing tables of constant weight codes are mainly confined to codes of length n ≤ 28. This paper presents tables of codes of lengths 29 ≤ n ≤ 63. The motivation for creating these tables was their application to the generation of good sets of frequency hopping lists in radio networks. The complete generation of all relevant cases by a small number of algorithms is augmented in individual cases by miscellaneous constructions. These sometimes give a larger number of codewords than the algorithms.
منابع مشابه
A new table of constant weight codes
A table of binary constant weight codes of length n <; 28 is presented. Explicit constructions are given for most of the 600 codes in the table; the majority of these codes are new. The known techniques for constructing constant weight codes are surveyed, and also a table is given of (unrestricted) binary codes of length J1 <; 28.
متن کاملSome new distance-4 constant weight codes
Improved binary constant weight codes with minimum distance 4 and length at most 28 are constructed. A table with bounds on the chromatic number of small Johnson graphs is given.
متن کاملHeuristic Construction of Constant Weight Binary Codes
Constant weight binary codes are used in a number of applications. The most fully developed treatment of these codes in the literature is restricted to codes of length at most 28. Only recently have comprehensive results been presented for longer codes. Constructions based on mathematical structure are known for many of the shorter codes. However, such constructions are rarer for lengths greate...
متن کاملUpper Bounds for Constant - Weight
| Let A(n; d; w) denote the maximum possible number of codewords in an (n; d; w) constant-weight binary code. We improve upon the best known upper bounds on A(n; d; w) in numerous instances for n 6 24 and d 6 10, which is the parameter range of existing tables. Most improvements occur for d = 8; 10, where we reduce the upper bounds in more than half of the unresolved cases. We also extend the e...
متن کاملOptimal Constant Weight Codes
A new class of binary constant weight codes is presented. We establish new lower bound and exact values on A(n, 2k, k + 1), in particular, A(30, 12, 7) = 9, A(48, 16, 9) = 11, A(51,16, 9) = 12, A(58, 18, 10) = 12. An ( ) w d n , , constant weight binary code is a code of length n , code distance d in which all code words have the same number of “ones” . The number of “ones” is w . We will denot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 13 شماره
صفحات -
تاریخ انتشار 2006